A Note on Percolation on Z: Isoperimetric Profile via Exponential Cluster Repulsion
نویسنده
چکیده
We show that for all p > pc(Z) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. Then we use this to give a very short proof of the important fact that the isoperimetric profile of the infinite cluster basically coincides with the profile of the original lattice. This implies for instance that simple random walk on the largest cluster of a finite box [−n,n]d with high probability has L∞-mixing time Θ(n), and that the heat kernel (return probability) on the infinite cluster a.s. decays like pn(o, o) = O(n−d/2). Versions of these results have been proven by Benjamini and Mossel (2003), Mathieu and Remy (2004), Barlow (2004) and Rau (2006). We also give a short proof of a theorem of Angel, Benjamini, Berger and Peres (2006): the infinite percolation cluster of a wedge in Z is a.s. transient whenever the wedge itself is transient.
منابع مشابه
Isoperimetry and heat kernel decay on percolation clusters
Short title: Isoperimetry on percolation clusters. Abstract: we prove that the heat kernel on the infinite Bernoulli percolation cluster in Z almost surely decays faster than t−d/2. We also derive estimates on the mixing time for the random walk confined to a finite box. Our approach is based on local isoperimetric inequalities. Some of the results of this paper were previously announced in the...
متن کاملExplicit isoperimetric constants, phase transitions in the random-cluster and Potts models, and Bernoullicity
The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results for the random-cluster model with cluster parameter q ≥ 1 are obtained. These include an explicit pointwise dynamical construction of random-cluster measures for arbitrary graphs, and for unimodular transitive graphs, lack of percolation for ...
متن کاملCritical exponents in percolation via lattice animals
We examine the percolation model by an approach involving lattice animals, divided according to their surface-area-to-volume ratio. Throughout, we work with the bond percolation model in Z. However, the results apply to the site or bond model on any infinite transitive amenable graph with inessential changes. For any given p ∈ (0, 1), two lattice animals with given size are equally likely to ar...
متن کاملInterlacement percolation on transient weighted graphs
In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [14], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and analyze some of its properties on specific classes of graphs. For the case of non-amenable graphs, we prove that the critical value u∗ for the percolation of the vacant set...
متن کاملA Resistance Bound Via An Isoperimetric Inequality
An isoperimetric upper bound on the resistance is given. As a corollary we resolve two problems, regarding mean commute time on finite graphs and resistance on percolation clusters. Further conjectures are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007